Combinatorial Online Optimization in Real Time
نویسندگان
چکیده
Optimization is the task of finding an optimum solution to a given problem. When the decision variables are discrete we speak of a combinatorial optimization problem. Such a problem is online when decisions have to be made before all data of the problem are known. And we speak of a real-time online problem when online decisions have to be computed within very tight time bounds. This paper surveys the are of combinatorial online and real-time optimization, it discusses, in particular, the concepts with which online and real-time algorithms can be analyzed.
منابع مشابه
Development of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملMeta Online Learning: Experiments on a Unit Commitment Problem
Online learning is machine learning, in real time from successive data samples. Meta online learning consists in combining several online learning algorithms from a given set (termed portfolio) of algorithms. The goal can be (i) mitigating the effect of a bad choice of online learning algorithms (ii) parallelization (iii) combining the strengths of different algorithms. Basically, meta online l...
متن کاملResidential Demand Response under Uncertainty
This paper considers a residential market with real-time electricity pricing and flexible electricity consumption profiles for customers. Such a market raises an optimisation problem for home automation systems where they need to schedule consumption activities to reduce costs, whilst maintaining a base level of comfort and convenience. This optimisation problem faces uncertainty in real-time p...
متن کاملReal-time Heuristic Search for Combinatorial Optimization and Constraint Satisfaction
We summarize a new approach to real-time heuristic tree search for problems with a fixed goal depth, such as combinatorial optimization and constraint satisfaction problems. Best-leaf-first search (BLFS) is a general and complete algorithm that visits leaves in an order that efficiently approximates increasing predicted cost. It can adapt its search order on-line to the current problem. Empiric...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کامل